Adding Relations in the Same Level of a Linking Pin Type Organization Structure
نویسنده
چکیده
This paper proposes two models of adding relations to a linking pin type organization structure where every pair of siblings in a complete Kary tree of height H is adjacent: (i) a model of adding an edge between two nodes with the same depth N and (ii) a model of adding edges between every pair of nodes with the same depth N . For each of the two models, an optimal depth N∗ is obtained by maximizing the total shortening path length which is the sum of shortening lengths of shortest paths between every pair of all nodes.
منابع مشابه
Models of Adding Relations to a Linking Pin Type Organization Structure
This paper proposes two models of adding relations to a linking pin type organization structure where every pair of siblings in a complete Kary tree of height H is adjacent: (i) a model of adding an edge between two nodes with the same depth N and (ii) a model of adding edges between every pair of nodes with the same depth N . For each of the two models, an optimal depth N∗ is obtained by maxim...
متن کاملAdding an Edge between the Root and a Node of a Complete K-ary Linking Pin Structure Maximizing Total Shortening Distance
This study considers the addition of relation to an organization structure such that the communication of information between every member in the organization becomes the most efficient. This paper proposes a model of adding relation to a complete K-ary linking pin structure where every pair of siblings in a complete K-ary tree is adjacent. For a model of adding an edge between the root and a n...
متن کاملAdding an Edge between a Node and its Descendant of a Complete K-ary Linking Pin Structure Maximizing Total Shortening Distance
Abstract—This paper proposes a model of adding relation to a linking pin organization structure where every pair of siblings in a complete K-ary tree of height H is adjacent such that the communication of information in the organization becomes the most efficient. For a model of adding an edge between a node with a depth M and its descendant with a depth N, we formulated the total shortening di...
متن کاملA Model of Adding Relation between Two Levels of a Linking Pin Organization Structure
This paper proposes a model of adding relation to a linking pin organization structure where every pair of siblings in a complete binary tree of height H is adjacent such that the communication of information in the organization becomes the most efficient. For a model of adding an edge between a node with a depth M and its descendant with a depth N , we formulated the total shortening distance ...
متن کاملA Model of Adding Relation between the Top and a Member of a Linking Pin Organization Structure with K Subordinates
This study considers the addition of relation to an organization structure such that the communication of information between every member in the organization becomes the most efficient. This paper proposes a model of adding relation to a linking pin organization structure where every pair of siblings in a complete K-ary tree of height H is adjacent. When a new edge between the root and a node ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007